A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.     

Proactive resource allocation for asynchronous real-time distributed systems in the presence of processor failures

We present two proactive resource allocation algorithms, RBA^*-FT and OBA-FT, for fault-tolerant asynchronous real-time distributed systems. The algorithms consider an application model where task timeliness is specified by Jensen's benefit functions and the anticipated application workload during future time intervals is described by adaptation functions. In addition, we assume that reliability functions of processors are available a priori. Given these models, our objective is to maximize aggregate task benefit and minimize aggregate missed deadline ratio in the presence of processor failures. Since determining the optimal solution is computationally intractable, the algorithms heuristically compute sub-optimal resource allocations, but in polynomial time. Experimental results reveal that RBA^*-FT and OBA-FT outperform their non-fault-tolerant counterparts in the presence of processor failures. Furthermore, RBA^*-FT performs better than OBA-FT, although OBA-FT incurs better worst-case and amortized computational costs. Finally, we observe that both algorithms robustly withstand errors in the estimation of anticipated failures.     

Psychological separation, attachment security, vocational self-concept crystallization, and career indecision: A structural equation analysis.

Structural equation modeling was used to test theoretically based models in which psychological separation and attachment security variables were related to career indecision and those relations were mediated through vocational self-concept crystallization. In contrast to previous studies, which have found either weak or no support for a relation between separation or attachment security variables and career indecision, results based on a sample of 350 college students indicated that some components of separation and attachment security did relate to career indecision in a theoretically supportable direction. Results also revealed that regardless of whether global or component career indecision measures were used, separation and attachment security effects on indecision were at least partially mediated through vocational self-concept crystallization. The strongest mediated relations were observed for the effects of attachment anxiety and maternal separation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

基于ASK无线数传模块的新型安防系统

将无线数传模块和具有低噪声的策控制电路集成设计为一体，构成检测信号和开关量控制信号无线传输的功能模块，并将该模块嵌入到探头和控制器内部，建立无线通讯子网，应用于智能能楼宇安防系统。很好的解决了无线信息冲突问题。经过试运行，系统工作稳定，无线探头报警可靠性达到了使用需求。     

关于构建下一代网络问题的讨论

分析了软交换向IMS演进存在的问题,从安全性及QoS角度讨论了下一代网络的构建,并分析了IPv6协议的不足之处和中国电信业需要考虑的几个关键问题.     

半导体晶圆制造车间层控制的内容及方法

半导体晶圆制造企业是资本密集、技术密集型产业,晶圆制造厂也是公认生产最为复杂的工厂之一。产品更新换代快、市场竞争激烈等特点使得投资者对设备产能和设备利用率高度重视。这已不仅仅是技术问题,而是生产制造过程管理的问题。本文介绍了半导体晶圆制造车间层控制的内容及方法。     

Location and calculation-free node-scheduling schemes in large wireless sensor networks

In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime without sacrificing system original performance (sensing coverage and sensing reliability). To solve this problem, one of the potential approaches is to identify redundant nodes at the sensing interface and then assign them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In our previous work [J. Wireless Commun. Mobile Comput. 3 (2003) 271; Processing of ACM Wireless Sensor Network and Application Workshop 2002, September 2002], we proposed a node-scheduling scheme, which can provide a 100% sensing coverage preservation capability. This, however, requires each node to be aware of its own and its neighbors’ location information. Also, in that scheme, each node has to do accurate geometrical calculation to determine whether to take an off-duty status. In this paper, we propose and study several alternative node-scheduling schemes, which cannot completely preserve the original system coverage, but are nonetheless light-weighted and flexible compared with the previous one. Our simulation results compare these schemes with the previous one and demonstrate their effectiveness.     

CAM中一类新的NP完全问题

本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性。     

Scheduling in or-parallel Prolog systems: Survey and open problems

Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB     

Parallelization of WHILE loops on pipelined architectures

Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90.